Low−complexity Lossless Compression of Hyper− and Ultra−spectral Images Based on Slepian−wolf Coding

نویسندگان

  • Enrico Baccaglini
  • Mauro Barni
  • Luca Capobianco
  • Andrea Garzelli
  • Enrico Magli
  • Filippo Nencini
  • Raffaele Vitulli
چکیده

Distributed source coding makes it possible to develop compression algorithms with a low−complexity encoder, while most of the signal modeling is moved to the decoder. This structure is an excellent match to the remote sensing scenario, in which the on−board processing units have limited computational capabilities. Moreover, remote sensing images do not exhibit motion, which greatly simplifies the design of a distributed coder. In this paper we propose a new algorithm for lossless compression of remote sensing images, based on distributed source coding. The objective of this algorithm is to achieve very low−complexity encoding, with performance as close as possible to a full−complexity coder. The complexity reduction is obtained by coding each spectral channel separately, whereas high coding efficiency is achieved through joint decoding. [continued on the next page]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universal Coding for Lossless and Lossy Complementary Delivery Problems

This paper deals with a coding problem called complementary delivery, where messages from two correlated sources are jointly encoded and each decoder reproduces one of two messages using the other message as the side information. Both lossless and lossy universal complementary delivery coding schemes are investigated. In the lossless case, it is demonstrated that a universal complementary deliv...

متن کامل

Exploiting Spatial Correlation in Pixel-Domain Distributed Image Compression

Contrary to convention, we construct distributed image compression codecs that operate in the pixel-domain, yet exploit spatial correlation at the decoder only. For lossless compression of binary images of text, we propose two novel decoders: one assumes the image to be a one-dimensional stationary Markov process, and the other assumes it to be a two-dimensional stationary Markov random field. ...

متن کامل

Layered Wyner - Ziv Video Coding for Noisy Channels

Layered Wyner-Ziv Video Coding for Noisy Channels. (August 2004) Qian Xu, B.S., University of Science & Technology of China Chair of Advisory Committee: Dr. Zixiang Xiong The growing popularity of video sensor networks and video celluar phones has generated the need for low-complexity and power-efficient multimedia systems that can handle multiple video input and output streams. While standard ...

متن کامل

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Subset-sum phase transitions and data compression

We propose a rigorous analysis approach for the subset sum problem in the context of lossless data compression, where the phase transition of the subset sum problem is directly related to the passage between ambiguous and non–ambiguous decompression, for a compression scheme that is based on specifying the sequence composition. The proposed analysis lends itself to straightforward extensions in...

متن کامل

Subset sum phase transitions and data compression

We propose a rigorous analysis approach for the subset sum problem in the context of lossless data compression, where the phase transition of the subset sum problem is directly related to the passage between ambiguous and non–ambiguous decompression, for a compression scheme that is based on specifying the sequence composition. The proposed analysis lends itself to straightforward extensions in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007